Commuting Probability Revisions: The Uniformity Rule
نویسنده
چکیده
A simple rule of probability revision ensures that the final result of a sequence of probability revisions is undisturbed by an alteration in the temporal order of the learning prompting those revisions. This Uniformity Rule dictates that identical learning be reflected in identical ratios of certain new-to-old odds, and is grounded in the old Bayesian idea that such ratios represent what is learned from new experience alone, with prior probabilities factored out. The main theorem of this paper includes as special cases (i) Field’s theorem on commuting probabilitykinematical revisions and (ii) the equivalence of two strategies for generalizing Jeffrey’s solution to the old evidence problem to the case of uncertain old evidence and probabilistic new explanation.
منابع مشابه
Commuting Probability Revisions: The Uniformity Rule: In Memoriam Richard Jeffrey, 1926-2002
A simple rule of probability revision ensures that the final result of a se? quence of probability revisions is undisturbed by an alteration in the temporal order of the learning prompting those revisions. This Uniformity Rule dictates that identical learning be reflected in identical ratios of certain new-to-old odds, and is grounded in the old Bayesian idea that such ratios represent what is ...
متن کاملProbability Revision, the Uniformity Rule, and the Chan-Darwiche Metric
The author has proposed a rule of probability revision dictating that identical learning be reflected in identical ratios of new to old odds. Following this rule ensures that the final result of a sequence of probability revisions is undisturbed by an alteration in the temporal order of the learning prompting these revisions. There is also a close connection between this rule and an intriguing ...
متن کاملRelative n-th non-commuting graphs of finite groups
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
متن کاملImprovement of Rule Generation Methods for Fuzzy Controller
This paper proposes fuzzy modeling using obtained data. Fuzzy system is known as knowledge-based or rule-bases system. The most important part of fuzzy system is rule-base. One of problems of generation of fuzzy rule with training data is inconsistence data. Existence of inconsistence and uncertain states in training data causes high error in modeling. Here, Probability fuzzy system presents to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003